On the chromaticity of complete multipartite graphs with certain edges added
نویسندگان
چکیده
Let P.G; / be the chromatic polynomial of a graph G. A graph G is chromatically unique if for
منابع مشابه
Chromaticity of Turan Graphs with At Most Three Edges Deleted
Let $P(G,lambda)$ be the chromatic polynomial of a graph $G$. A graph $G$ ischromatically unique if for any graph $H$, $P(H, lambda) = P(G,lambda)$ implies $H$ is isomorphic to $G$. In this paper, we determine the chromaticity of all Tur'{a}n graphs with at most three edges deleted. As a by product, we found many families of chromatically unique graphs and chromatic equivalence classes of graph...
متن کاملThe Chromaticity of Certain Complete Multipartite Graphs
In this paper, we first establish a useful inequality on the minimum real roots of the adjoint polynomials of the complete graphs. By using it, we investigate the chromatic uniqueness of certain complete multipartite graphs. An unsolved problem (i.e., Problem 11), posed by Koh and Teo in Graph and Combin. 6(1990) 259–285, is completely solved by giving it a positive answer. Moreover, many exist...
متن کاملRamsey numbers in complete balanced multipartite graphs. Part I: Set numbers
The notion of a graph theoretic Ramsey number is generalised by assuming that both the original graph whose edges are arbitrarily bi–coloured and the sought after monochromatic subgraphs are complete, balanced, multipartite graphs, instead of complete graphs as in the classical definition. We previously confined our attention to diagonal multipartite Ramsey numbers. In this paper the definition...
متن کاملRamsey numbers in complete balanced multipartite graphs. Part II: Size numbers
The notion of a graph theoretic Ramsey number is generalised by assuming that both the original graph whose edges are arbitrarily bi–coloured and the sought after monochromatic subgraphs are complete, balanced, multipartite graphs, instead of complete graphs as in the classical definition. We previously confined our attention to diagonal multipartite Ramsey numbers. In this paper the definition...
متن کاملCycle decompositions of complete and complete multipartite graphs
This paper is concerned with the partition of edges of the complete graph Kn and the complete multipartite graph K-m, ... ,-m into subgraphs isomor-phic to cycles. We show that Kn and K-m, ... ,m can be decomposed into certain families of cycles by defining a special decomposition which we call a root path decomposition.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 309 شماره
صفحات -
تاریخ انتشار 2009